Complexity Lecturer : Trevor Brown
نویسنده
چکیده
In these notes, we study the intersection of communication complexity and distributed computing. To understand why distributed computing researchers care about communication complexity tools and results, we briefly turn our attention to distributed computing. In traditional distributed computing models, local computation is free, and communication between parties is expensive. Typical complexity measures include the number of messages sent (message complexity), the total number of bits sent (bit complexity), and the total number of rounds of computation in synchronous models (round complexity). Communication complexity is interested in these same complexity measures, and the most common communication complexity models are very similar (in some cases identical) to distributed computing models. In part, this is because communication complexity emerged from the study of distributed computing, and early interest in its models was driven by applications in distributed computing. For example, number-on-forehead models, wherein each player can see only the inputs of other players, were initially considered unrealistic (and less interesting) because they did not coincide with distributed computing models. In contrast, number-in-hand models, wherein each player sees only her own input, can be applied immediately to distributed computing problems, and have been studied extensively.
منابع مشابه
A Methodology for the Construction of Accurate Timing Macromodels for Digital Circuits
ii To my family. iii ACKNOWLEDGEMENTS I would like to thank all those who helped me in completing this dissertation. Most and foremost, Karem Sakallah, who has been an outstanding academic advisor and a very good friend for the course of my graduate work at Michigan. His suggestions, thorough reviews, and encouragement at the various stages of my Ph.D research are gratefully acknowledged. Many ...
متن کاملB-slack trees: Highly Space Efficient B-trees
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
متن کاملB-slack Trees: Space Efficient B-Trees
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(logb n), where b is the maximum node degree. Updates can be performed in O(log b 2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.
متن کاملHip Joint Trevor Disease: Literature Review and a Case Report
Trevor disease or dysplasia epiphysealis hemimelica (DEH) is an extremely rare condition with incidence of about 1:1,000,000. Male to female ratio of reporting case is 3:1, and usually diagnosed between two and eight years old. It usually affects the medial portion of the joint, but lateral involvement is not uncommon. Hip-joint was affected in less than 4% of existing cases in the literature. ...
متن کامل